Skew doubled shifted plane partitions: Calculus and asymptotics

نویسندگان

چکیده

<p style='text-indent:20px;'>In this paper, we establish a new summation formula for Schur processes, called the <i>complete formula</i>. As an application, obtain generating function and asymptotic number of <i>doubled shifted plane partitions</i>, which can be viewed as partitions "shifted at two sides". We prove that order depends only on diagonal width doubled partition, not profile (the skew zone) itself. By using similar methods, <i>symmetric cylindric partitions</i> are also derived.</p>

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shifted Schur Process and Asymptotics of Large Random Strict Plane Partitions

In this paper we define the shifted Schur process as a measure on sequences of strict partitions. This process is a generalization of the shifted Schur measure introduced in [TW] and [Mat] and is a shifted version of the Schur process introduced in [OR1]. We prove that the shifted Schur process defines a Pfaffian point process. We further apply this fact to compute the bulk scaling limit of the...

متن کامل

Generating functions for shifted plane partitions

With the help of a tableaux method, determinant formulas for trace generating functions for various classes of shifted plane partitions are derived. Proceeding from these determinants, generalizations of Gansner's (J. hook formulas for shifted plane partitions and alternative proofs of recent results of Proctor about alternating trace generating functions are given.

متن کامل

Bivariate Asymptotics for Striped Plane Partitions

We give a new asymptotic formula for a refined enumeration of plane partitions. Specifically: color the parts πi,j of a plane partition π according to the equivalence class of i−j (mod 2), and keep track of the sums of the 0-colored and 1-colored parts seperately. We find, for large plane partitions, that the difference between these two sums is asymptotically Gaussian (and we compute the mean ...

متن کامل

Combinatorial Proofs of Hook Generating Functions for Skew Plane Partitions

Sagan, B.E., Combinatorial proofs of hook generating functions for skew plane partitions, Theoretical Computer Science 117 (1993) 273-287. We provide combinatorial proofs of two hook generating functions for skew plane partitions. One proof involves the Hillman-Grass1 (1976) algorithm and the other uses a modification of Schiitzenberger’s (1963, 1977) “jeu de taquin” due to Kadell (to appear). ...

متن کامل

Finding Skew Partitions Efficiently

A skew partition as defined by Chvátal is a partition of the vertex set of a graph into four nonempty parts A B C D such that there are all possible edges between A and B and no edges between C and D. We present a polynomial-time algorithm for testing whether a graph admits a skew partition. Our algorithm solves the more general list skew partition problem, where the input contains, for each ve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic research archive

سال: 2021

ISSN: ['2688-1594']

DOI: https://doi.org/10.3934/era.2020094